|
In proof theory, a branch of mathematical logic, proof mining (or unwinding) is a research program that analyzes formalized proofs, especially in analysis, to obtain explicit bounds or rates of convergence from proofs that, when expressed in natural language, appear to be nonconstructive.〔 〕 This research has led to improved results in analysis obtained from the analysis of classical proofs. == References == 〔 * Ulrich Kohlenbach and Paulo Oliva, "Proof Mining: A systematic way of analysing proofs in mathematics", ''Proc. Steklov Inst. Math'', 242:136–164, 2003 * Paulo Oliva, "Proof Mining in Subsystems of Analysis", BRICS PhD thesis (citeseer ) 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「proof mining」の詳細全文を読む スポンサード リンク
|